A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
نویسندگان
چکیده
Network flow problems form an important and much-studied family of combinatorial optimization problems, with a huge array practical applications. Two network in particular have received great deal attention: the maximum minimum-cost problems. We review progress that has been made on exact solution algorithms for these two emphasis worst-case running times.
منابع مشابه
Distance-Directed Augmenting Path Algorithms for Maximum Flow and Parametric Maximum Flow Problems
Until recently, fast algorithms for the maximum flow problem have typically proceeded by constructing layered networks and establishing blocking flows in these networks. However, in recent years, new distance-directed algorithms have been suggested that do not construct layered networks but instead maintain a distance label with each node. The distance label of a node is a lower bound on the le...
متن کاملA Survey of Algorithms for Convex Multicommodity Flow Problems
There are many problems related to the design of networks. Among them, the message routing problem plays a determinant role in the optimization of network performance. Much of the motivation for this work comes from this problem which is shown to belong to the class of nonlinear convex multicommodity ow problems. This paper emphasizes the message routing problem in data networks, but it include...
متن کاملEXACT SOLUTIONS FOR FLOW OF A SISKO FLUID IN PIPE
By means of He's homotopy perturbation method (HPM) an approximate solution of velocity eld is derived for the ow in straight pipes of non-Newtonian uid obeying the Sisko model. The nonlinear equations governing the ow in pipe are for- mulated and analyzed, using homotopy perturbation method due to He. Furthermore, the obtained solutions for velocity eld is graphically sketched...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملCOVERT Based Algorithms for Solving the Generalized Tardiness Flow Shop Problems
Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2023
ISSN: ['0028-3045', '1097-0037']
DOI: https://doi.org/10.1002/net.22169